課程大綱

課程資訊

課程名稱

密碼學計算理論基礎
Foundation of Cryptography

開課學期

100-2

授課對象

理學院數學研究所

授課教師

丁培毅

課號

MATH5149

課程識別碼

221 U5500

班次

學分

全/半年

半年

必/選修

選修

上課時間

星期三6,7,8(13:20~16:20)

上課地點

天數302

備註

總人數上限：30人

Ceiba 課程網頁

http://ceiba.ntu.edu.tw/1002FundCrypto

課程簡介影片

核心能力關聯

本課程尚未建立核心能力關連

課程大綱

為確保您我的權利,請尊重智慧財產權及不得非法影印

課程概述

1. Fundamental mathematical tools in provable security
2. One way function
3. Pseudorandom generator and pseudorandom function
4. Zero-knowledge proof
5. Provable security of encryption and signature schemes

課程目標

Introduce the theoretical foundations of provable security for modern cryptography and secure protocols. It is expected to get your foot in the door of modern research topics of security and cryptography.

課程要求

Prerequisite: Elementary Cryptography (such that you have very good background knowledge while we take existing schemes as example. However, if you are not familiar with these schemes you will still find the descriptions of these schemes quite manageable with the knowledge of basic number theory)

預期每週課後學習時數

Office Hours

指定閱讀

If you have taken the course "Cryptography" previously and are familiar with Nigel's book, you can try reading Chapter 18 - Chapter 22.

Nigel Smart, Cryptography: An Introduction, 3rd Ed.,

參考書目

Textbook: Foundation of Cryptography, Vol. I,II, O. Goldreich
Introduction to Modern Cryptography: Principles and Protocols, J. Katz
1. Crypto, Eurocrypt, Asiacrypt, PKC conference papers
2. Cryptography: Theory and Practice, Stinson
3. Lecture notes on Cryptography, S. Goldwasser
4. Lecture notes on Cryptography, M. Bellare and Rogway
5. Berkeley CS276 class notes, Cryptography, Trevisan and Wagner
6. U. Maryland class notes, Cryptography, J. Katz
7. U. Technion class notes, Cryptography, M. Naor

評量方式
(僅供參考)

No.	項目	百分比	說明
1.	期中考	40%
2.	期末報告	60%

課程進度

週次	日期	單元主題
第1週	02/22	Introduction of provable security, Security definition, security proof, assumptions
第2週	02/29	Security of encryption scheme, signature scheme Computation models, Perfect security
第3週	03/07	Probability inequalities, adversary models, asymptotic security, one-way function, claw-free function, hardcore predicate
第4週	03/14	More one-way functions, trapdoor one-way functions, secure encryption from TDF, secure signature from OWF
第5週	03/21	Hash function security, indistinguishability, pseudo-random number generator, secure encryption from PRNG, pseudo-random function
第6週	03/28	zero-knowledge protocols, security definition, honest verifier ZKP, non-interactive zero-knowledge protocols
第7週	04/04	no class
第8週	04/11	random oracle model, security notions of encryption scheme, standard model encryption scheme
第9週	04/18	security notions of signature schemes, practical signature schemes, standard model signature schemes
第10週	04/25	midterm exam, discussion of final mini-project and report
第11週	05/02	simulation based security notions, game based proof methodology
第12週	05/09	brief presentation and discussions, identity based cryptology
第13週	05/16	brief presentation and discussions, searchable encryption scheme
第14週	05/23	brief presentation and discussions, relations of cryptographic primitives
第15週	05/30	group presentation
第16週	06/06	group presentation
第17週	06/13	group presentation
第18週	06/20	group presentation